Stability of queueing networks
نویسنده
چکیده
2 The classical networks 186 2.1 Main results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 2.2 Stationarity and reversibility . . . . . . . . . . . . . . . . . . . . 191 2.3 Homogeneous nodes of Kelly type . . . . . . . . . . . . . . . . . . 195 2.4 Symmetric nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 2.5 Quasi-reversibility . . . . . . . . . . . . . . . . . . . . . . . . . . 207
منابع مشابه
Stability in Queueing Networks via the Finite Decomposition Property
Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has the finite decomposition property (FDP) and is not weakly stable, then any queueing network associated with the fluid network is not rate stable. In that paper the FDP was demonstrated for two station queueing networks ...
متن کاملGamarnik : Using Fluid Models to Prove Stability of Adversarial Queueing Networks
| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is deened to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is im...
متن کاملStability of Adversarial Queues via Fluid Models
The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question i...
متن کاملUsing fluid models to prove stability of adversarial queueing networks
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is imp...
متن کاملStability of Fluid Networks with Proportional Routing
In this paper we investigate the stability of a class of two-station multiclass fluid networks with proportional routing. We obtain explicit necessary and sufficient conditions for the global stability of such networks. By virtue of a stability theorem of Dai [14], these results also give sufficient conditions for the stability of a class of related multiclass queueing networks. Our study exten...
متن کاملStability conditions for multiclass uid queueing networks
We introduce a new method to investigate stability of work-conserving policies in multiclass queueing networks. The method decomposes feasible trajectories and uses linear programming to test stability. We show that this linear program is a necessary and suucient condition for the stability of all work-conserving policies for multiclass uid queueing networks with two stations. Furthermore, we n...
متن کامل